Critical groups of strongly regular graphs and their generalizations

We determine the maximum order of an element in critical group a strongly regular graph, and show that it achieves spectral bound due to Lorenzini. extend result all graphs with exactly two non-zero Laplacian eigenvalues, study signed graph version problem. also monodromy pairing on groups, suggest approach structure these groups using pairing.